Boolean satisfiability problem

Results: 324



#Item
51NP-complete problems / Boolean satisfiability problem / NP-complete / Satisfiability / Maximum cut / Algorithm / Graph coloring / 2-satisfiability / Theoretical computer science / Mathematics / Applied mathematics

BRICS DS-04-5 B. Skjernaa: Exact Algorithms for Variants of Satisfiability and Colouring Problems BRICS Basic Research in Computer Science

Add to Reading List

Source URL: www.brics.dk

Language: English - Date: 2005-04-05 15:07:30
52Complexity classes / NP-complete problems / Boolean algebra / Electronic design automation / Formal methods / Boolean satisfiability problem / Conjunctive normal form / NP-complete / Canonical form / Theoretical computer science / Mathematics / Applied mathematics

CS 170 Algorithms Spring 2009

Add to Reading List

Source URL: www-inst.eecs.berkeley.edu

Language: English - Date: 2009-05-04 23:56:17
53Tree decomposition / Path decomposition / Width / Boolean satisfiability problem / Graph theory / Theoretical computer science / Graph operations

Treewidth in Verification: Local vs. Global⋆ Andrea Ferrara1 , Guoqiang Pan2 , and Moshe Y. Vardi2 1 DIS - Universit`a di Roma ”La Sapienza” Via Salaria 113, 00198 Roma, Italy

Add to Reading List

Source URL: www.cs.rice.edu

Language: English - Date: 2005-09-30 15:47:37
54Model theory / Metalogic / Predicate logic / Electronic design automation / Linear temporal logic / First-order logic / Boolean satisfiability problem / Well-formed formula / Constructible universe / Logic / Mathematical logic / Theoretical computer science

BRICS Basic Research in Computer Science BRICS RS-97-5 Etessami et al.: First-Order Logic with Two Variables and Unary Temporal Logic First-Order Logic with

Add to Reading List

Source URL: www.brics.dk

Language: English - Date: 1997-06-05 08:58:45
55Logic in computer science / Logic programming / Automated planning and scheduling / Formal methods / Conjunctive normal form / Situation calculus / Planning Domain Definition Language / Algorithm / Boolean satisfiability problem / Theoretical computer science / Mathematics / Applied mathematics

Learning Partially Observable Action Models: Efficient Algorithms Dafna Shahaf Allen Chang Eyal Amir Computer Science Department University of Illinois, Urbana-Champaign Urbana, IL 61801, USA {dshahaf2,achang6,eyal}@uiuc

Add to Reading List

Source URL: infolab.stanford.edu

Language: English - Date: 2010-08-28 23:41:19
56Algebraic logic / Fuzzy logic / Logic in computer science / Algebraic structures / Electronic design automation / Satisfiability Modulo Theories / MV-algebra / Boolean satisfiability problem / Propositional variable / Mathematics / Mathematical logic / Logic

Basic Logic, SMT solvers and nitely generated varieties of GBL-algebras Peter Jipsen Chapman University, Orange, California TACL 2013, July 29, Vanderbilt University

Add to Reading List

Source URL: math.chapman.edu

Language: English - Date: 2013-09-06 00:51:19
57Metalogic / Logic in computer science / Formal languages / Model theory / Modal logic / Method of analytic tableaux / Well-formed formula / Boolean satisfiability problem / Satisfiability / Logic / Mathematical logic / Mathematics

October 27, 2013 Journal of Applied Non-Classical Logics main

Add to Reading List

Source URL: files.oliverfriedmann.de

Language: English - Date: 2013-10-27 20:44:29
58Elementary mathematics / Cardinal numbers / Boolean algebra / Mathematical optimization / Integer / Finite set / NP / Cardinality / Boolean satisfiability problem / Mathematics / Theoretical computer science / Complexity classes

On Decision Procedures for Ordered Collections

Add to Reading List

Source URL: lara.epfl.ch

Language: English - Date: 2010-02-08 11:12:45
59Linear algebra / Boolean algebra / Electronic design automation / Formal methods / NP-complete problems / Multiset / Boolean satisfiability problem / Vector space / Theorems and definitions in linear algebra / Mathematics / Algebra / Theoretical computer science

Linear Arithmetic with Stars Ruzica Piskac and Viktor Kuncak School of Computer and Communication Sciences, EPFL, Switzerland Abstract. We consider an extension of integer linear arithmetic with a “star” operator tak

Add to Reading List

Source URL: lara.epfl.ch

Language: English - Date: 2008-11-06 07:52:12
60Model theory / Electronic design automation / Logic in computer science / NP-complete problems / First-order logic / Function / Interpretation / FO / Boolean satisfiability problem / Mathematics / Logic / Mathematical logic

Collections, Cardinalities, and Relations Kuat Yessenov1⋆ , Ruzica Piskac2 , and Viktor Kuncak2⋆⋆ 1 2

Add to Reading List

Source URL: lara.epfl.ch

Language: English - Date: 2009-11-10 09:06:44
UPDATE